Cyclic Labellings with Constraints at Two Distances
نویسندگان
چکیده
Motivated by problems in radio channel assignment, we consider the vertexlabelling of graphs with nonnegative integers. The objective is to minimize the span of the labelling, subject to constraints imposed at graph distances one and two. We show that the minimum span is (up to rounding) a piecewise linear function of the constraints, and give a complete specification, together with the associated optimal assignments, for trees and cycles. the electronic journal of combinatorics 11 (2004), #R16 1
منابع مشابه
Triangular embeddings of complete graphs from graceful labellings of paths
We show that to each graceful labelling of a path on 2s + 1 vertices, s ≥ 2, there corresponds a current assignment on a 3-valent graph which generates at least 22s cyclic oriented triangular embeddings of a complete graph on 12s + 7 vertices. We also show that in this correspondence, two distinct graceful labellings never give isomorphic oriented embeddings. Since the number of graceful labell...
متن کاملLinear plus fractional multiobjective programming problem with homogeneous constraints using fuzzy approach
We develop an algorithm for the solution of multiobjective linear plus fractional programming problem (MOL+FPP) when some of the constraints are homogeneous in nature. Using homogeneous constraints, first we construct a transformation matrix T which transforms the given problem into another MOL+FPP with fewer constraints. Then, a relationship between these two problems, ensuring that the solu...
متن کاملConnections between labellings of trees
There are many long-standing conjectures related with some labellings of trees. It is important to connect labellings that are related with conjectures. We find some connections between known labellings of simple graphs.
متن کاملGraceful labellings for an infinite class of generalised Petersen graphs
We exhibit a graceful labelling for each generalised Petersen graph P8t,3 with t ≥ 1. As an easy consequence, we obtain that for any fixed t the corresponding graph is the unique starter graph for a cyclic edgedecomposition of the complete graph K2t+1. Due to its extreme versatility, the technique employed looks promising for finding new graceful labellings, not necessarily involving generalise...
متن کاملBiochemical differentiation in a mutant of Dictyostelium discoideum defective in cyclic AMP chemotaxis and in intercellular cohesion.
A temperature-sensitive mutant of Dictyostelium discoideum has been isolated based on its lack of chemotaxis toward cyclic AMP at the restrictive temperature, 27 degrees C. The mutant develops normally at the permissive temperature, 22 degrees C, but fails to aggregate or complete development at the restrictive temperature. The temperature-sensitive phenotype can be bypassed by allowing culture...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 11 شماره
صفحات -
تاریخ انتشار 2004